Synthesizing Permissive Winning Strategy Templates for Parity Games

Abstract We present a novel method to compute permissive winning strategies in two-player games over finite graphs with $$ \omega ω -regular conditions. Given game graph G and parity condition $$\varPhi Φ , we strategy template $$\varPsi Ψ that collects an infinite number of for objective concise data structure. use this new representation sets tackle two problems arising from applications the context cyber-physical system design – (i) incremental synthesis i.e., adapting newly arriving, additional $$\omega objectives '$$ ′ (ii) fault-tolerant control occasional or persistent unavailability actuators. The main features our templates which utilize solving these challenges are their easy computability, adaptability, compositionality. For empirically show on large set benchmarks technique vastly outperforms existing approaches if added specifications increases. While is not complete, prototype implementation returns full region all 1400 benchmark instances, i.e. handling problem class efficiently practice.